Approximately matching polygonal curves with respect to the Fre'chet distance

Matching Polygonal Curves with Respect to the Fréchet Distance

Probabilistic matching of sets of polygonal curves∗

Analysis and comparison of geometric shapes are of importance in various application areas within computer science, e.g., pattern recognition and computer vision. The general situation in a shape matching problem is that we are given two shapes A and B and a certain class T of allowable transformations and we want to transform B optimally so that the transformed image of B is as close to A as p...

A faster algorithm for matching planar maps under the weak Fréchet distance

We consider the problem of matching a polygonal curve of complexity p with an arbitrary curve on an embedded planar graph of complexity q. With the large amount of GPS and location trace data that have become available in recent years, algorithms for such problems have become increasingly important. Direct applications include matching a GPS trace to a given roadmap and indirect applications in...

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

Partial Curve Matching under the Fréchet Distance∗

Curve matching is a fundamental problem which occurs in many applications. In this paper, we extend the Fréchet distance to measure partial curve similarity, study its properties, and develop efficient algorithms to compute it. In particular, under the L1 or L∞ metrics, we present an algorithm to compute, in O(m2) time, the partial Fréchet distance between a segment and a polygonal curve of siz...